Parallel Implementation of Multiple-Precision Arithmetic and 1, 649, 267, 440, 000 Decimal Digits of π Calculation
نویسنده
چکیده
We present efficient parallel algorithms for multiple-precision arithmetic operations of more than several million decimal digits on distributed-memory parallel computers. A parallel implementation of floating-point real FFT-based multiplication is used because a key operation in fast multiple-precision arithmetic is multiplication. We also parallelized an operation of releasing propagated carries and borrows in multiple-precision addition, subtraction and multiplication. More than 1.6 trillion decimal digits of π were computed on 256 nodes of Appro Xtreme-X3 (648 nodes, 147.2 GFlops/node, 95.4 TFlops peak performance) with a computing elapsed time of 137 hours 42 minutes which includes the time for verification.
منابع مشابه
Using multiple-precision arithmetic
There are many different kinds of problems for which high precision calculation can be useful. The most common situation involves a computation that is numerically unstable, so that using double precision is not sufficient to get the final result as accurately as it is needed. We will use the term “significant digits” to mean the number of equivalent decimal digits of precision, as opposed to t...
متن کاملNASA - TM - I 12062 The Computation of _ to 29 , 360 , 000 Decimal Digits
In a recent work [6], Borwein and Borwein derived a class of algorithms based on the theory of complete elliptic integrals that yield very rapidly convergent approximations to elementary constants. The author has implemented Borweins' quartically convergent algorithm for l/r, using a prime modulus transform multi-precision technique, to compute over 29,360,000 digits of the decimal expansion of...
متن کاملVlsi Implementation of N X N Parallel Decimal Multiplier Using Csa
This paper introduces two novel architectures for parallel decimal multipliers. Our multipliers are based on a new algorithm for decimal carry–save multioperand addition that uses a novel BCD–4221 recoding for decimal digits. It significantly improves the area and latency of the partial product reduction tree with respect to previous proposals. Decimal floating-point multiplication is important...
متن کاملParallel Computation of π Using High Precision Arithmetics
During the last decades estimating π has become a competition and a benchmarking tool. Many different algorithms have been developed and with the advent of high performance architectures it is possible to calculate very large number of π decimal digits. Within the scope of the Parallel Algorithms lecture a parallel library for high precision arithmetics will be introduced and its performance on...
متن کاملExploration in π Calculation Using Various Methods Implemented in Python
The mathematical constant π, found ubiquitously in many applications, has been a subject of interest for mathematicians ever since the beginning of recorded history. In order to seek out better understanding of its nature, calculation of the its decimal digits has been a perennial favored activity of many mathematicians throughout history. The length of digit of π capable of being obtained has ...
متن کامل